A simplified implementation of the least squares solution for pairwise comparisons matrices
نویسندگان
چکیده
منابع مشابه
A simplified implementation of the least squares solution for pairwise comparisons matrices
This is a follow up to ”Solution of the least squares method problem of pairwise comparisons matrix” by Bozóki published by this journal in 2008. Familiarity with this paper is essential and assumed. For lower inconsistency and decreased accuracy, our proposed solutions run in seconds instead of days. As such, they may be useful for researchers willing to use the least squares method (LSM) inst...
متن کاملSolution of the least squares method problem of pairwise comparison matrices
The aim of the paper is to present a new global optimization method for determining all the optima of the Least Squares Method (LSM) problem of pairwise comparison matrices. Such matrices are used, e.g., in the Analytic Hierarchy Process (AHP). Unlike some other distance minimizing methods, LSM is usually hard to solve because of the corresponding nonlinear and non-convex objective function. It...
متن کاملPairwise Comparisons Simplified
This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from n · (n − 1) to n − 1. An algorithm of reconstructing of the PC matrix from its set of generators is presented.
متن کاملOn some convexity properties of the Least Squares Method for pairwise comparisons matrices without the reciprocity condition
The relaxation of the reciprocity condition for pairwise comparisons is revisited from the optimization point of view. We show that some special but not extreme cases of the Least Squares Method are easy to solve as convex optimization problems after suitable nonlinear change of variables. We also give some other, less restrictive conditions under which the convexity of a modified problem can b...
متن کاملA Global Solution for the Structured Total Least Squares Problem with Block Circulant Matrices
We study the Structured Total Least Squares (STLS) problem of system of linear equations Ax = b, where A has a block circulant structure with N blocks. We show that by applying the Discrete Fourier Transform (DFT), the STLS problem decomposes into N unstructured Total Least Squares (TLS) problems. The N solutions of these problems are then assembled to generate the optimal global solution of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2010
ISSN: 1435-246X,1613-9178
DOI: 10.1007/s10100-010-0134-y